Multi-Agent Deployment for Visibility Coverage in Polygonal Environments with Holes

This article presents a distributed algorithm for a group of robotic agents with omnidirectional vision to deploy into nonconvex polygonal environments with holes. Agents begin deployment from a common point, possess no prior knowledge of the environment, and operate only under line-of-sight sensing and communication. The objective of the deployment is for the agents to achieve full visibility coverage of the environment while maintaining line-of-sight connectivity with each other. This is achieved by incrementally partitioning the environment into distinct regions, each completely visible from some agent. Proofs are given of (i) convergence, (ii) upper bounds on the time and number of agents required, and (iii) bounds on the memory and communication complexity. Simulation results and description of robust extensions are also included

A Novel Diabetes Education Program to Improve Diabetes Knowledge, Awareness and Glycemic Control

Diabetes self-management education (DSME), an integral part of diabetes management is delivered by trained educators in well-developed countries. Unfortunately, there is a dearth of an organized, concise and easy-to-deliver diabetes education module in India. The relationship between diabetes self-care and glycemic control has been studied extensively. The present review discusses an innovative diabetes self-education training module that can be easily reciprocated by others to benefit the larger population

Motion Coordination for Mobile Robotic Networks With Visibility Sensors

159 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.Third, we address problem (ii) by proposing a novel motion coordination algorithm for a group of robotic agents to achieve rendezvous, that is, to move to a common location inside a nonconvex environment. The robots move synchronously in discrete time, they have a range-limited visibility sensor, and no communication ability is required. The algorithm is designed using the notions of robust visibility, connectivity-preserving constraint sets, and proximity graphs. We rigorously establish the correctness of the algorithm and we illustrate through simulations the algorithm's performance in asynchronous setups with sensor measurement and control errors.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD